Knotting probability of self-avoiding polygons under a topological constraint

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characteristic length of random knotting for cylindrical self-avoiding polygons

We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius r. We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness r. keyword characteristic length, random knotting, self-avoiding polygons, knot invariants,knots PACS...

متن کامل

Compressed self-avoiding walks, bridges and polygons

We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the boundary of the half-space. In the case of bridges, this is the unique end-point. In the case of SAWs or self-avoiding polygons, this corresponds to all ver...

متن کامل

On fully extended self-avoiding polygons

The paper gives recurrence relations on the number of 2n step fully extended (i.e., full-dimensional) self-avoiding polygons in n-and (n-1)-dimensional integer lattices.

متن کامل

Scaling function for self-avoiding polygons

Exactly solvable models of planar polygons, weighted by perimeter and area, have deepened our understanding of the critical behaviour of polygon models in recent years. Based on these results, we derive a conjecture for the exact form of the critical scaling function for planar self-avoiding polygons. The validity of this conjecture was recently tested numerically using exact enumeration data f...

متن کامل

Self-avoiding polygons on the square lattice

We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective constant μ = 2.638 158 529 27(1) (biased) and the critical exponent α = 0.500 0005(10) (unbiased). The critical point is indistinguishable from a root of the polyno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Chemical Physics

سال: 2017

ISSN: 0021-9606,1089-7690

DOI: 10.1063/1.4996645